Double Blind <i>T</i>-Private Information Retrieval

نویسندگان

چکیده

Double blind $T$-private information retrieval (DB-TPIR) enables two users, each of whom specifies an index ($\theta_1, \theta_2$, resp.), to efficiently retrieve a message $W(\theta_1,\theta_2)$ labeled by the indices, from set $N$ servers that store all messages $W(k_1,k_2), k_1\in\{1,2,\cdots,K_1\}, k_2\in\{1,2,\cdots,K_2\}$, such users' indices are kept private any up $T_1,T_2$ colluding servers, respectively, as well other. A DB-TPIR scheme based on cross-subspace alignment is proposed in this paper, and shown be capacity-achieving asymptotic setting large number bounded latency. The then extended $M$-way $X$-secure (MB-XS-TPIR) with multiple ($M$) belonging different user, arbitrary privacy levels for ($T_1, T_2,\cdots, T_M$), level security ($X$) data storage, so $W(\theta_1,\theta_2,\cdots, \theta_M)$ can retrieved while stored held secure against collusion among $X$ $m^{th}$ user's $T_m$ $\theta_m$ other users. general relies tensor-product extension retrieves $1-(X+T_1+\cdots+T_M)/N$ bits desired per bit download.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Private Information Retrieval

Informally, private information retrieval for k >= 1 databases (k-PIR) is an interactive scheme that enables a user to make access to (separated) k replicated copies of a database and privately retrieve any single bit out of the n bits of data stored in the database. In this model, “privacy” implies that the user retrieves the bit he is interested in but releases to each database nothing about ...

متن کامل

Practical Private Information Retrieval

In recent years, the subject of online privacy has been attracting much interest, especially as more Internet users than ever are beginning to care about the privacy of their online activities. Privacy concerns are even prompting legislators in some countries to demand from service providers a more privacy-friendly Internet experience for their citizens. These are welcomed developments and in s...

متن کامل

Nearly Private Information Retrieval

A private information retrieval scheme is a protocol whereby a client obtains a record from a database without the database operators learning anything about which record the client requested. This concept is well studied in the theoretical computer science literature. Here, we study a generalization of this idea where we allow a small amount of information about the client’s intent to be leake...

متن کامل

The Capacity of Private Information Retrieval with Private Side Information

The problem of private information retrieval with private side information (PIR-PSI) is recently introduced by Kadhe et al. In this problem, N replicated databases each store K messages, of which M are known to the user as side-information. The identity of these M messages is unknown to the databases. The user wishes to retrieve, as efficiently as possible, a new desired message without reveali...

متن کامل

Private Information Retrieval with Partially Known Private Side Information

We consider the problem of private information retrieval (PIR) of a single message out of K messages from N replicated and non-colluding databases where a cache-enabled user of cache-size M messages possesses side information in the form of full messages that are partially known to the databases. In this model, the user and the databases engage in a two-phase scheme, namely, the prefetching pha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE journal on selected areas in information theory

سال: 2021

ISSN: ['2641-8770']

DOI: https://doi.org/10.1109/jsait.2021.3053481